assignment problem - определение. Что такое assignment problem
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое assignment problem - определение


Assignment problem         
COMBINATORIAL OPTIMIZATION PROBLEM
Linear assignment problem; Unbalanced assignment problem; Credit assignment problem
The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows:
assignment problem         
COMBINATORIAL OPTIMIZATION PROBLEM
Linear assignment problem; Unbalanced assignment problem; Credit assignment problem
<mathematics, algorithm> (Or "linear assignment") Any problem involving minimising the sum of C(a, b) over a set P of pairs (a, b) where a is an element of some set A and b is an element of set B, and C is some function, under constraints such as "each element of A must appear exactly once in P" or similarly for B, or both. For example, the a's could be workers and the b's projects. The problem is "linear" because the "cost function" C() depends only on the particular pairing (a, b) and is independent of all other pairings. http://forum.swarthmore.edu/epigone/comp.soft-sys.matlab/bringhyclu. http://soci.swt.edu/capps/prob.htm. http://mat.gsia.cmu.edu/GROUP95/0577.html. http://informs.org/Conf/WA96/TALKS/SB24.3.html. [Algorithms?] (1999-07-12)
Multidimensional assignment problem         
GENERALIZATION OF LINEAR ASSIGNMENT PROBLEM FROM TWO TO MULTIPLE DIMENSIONS
Draft:Multidimensional assignment problem (MAP); Multidimensional assignment problem (MAP)
The multidimensional assignment problem (MAP) is a fundamental combinatorial optimization problem which was introduced by William Pierskalla. This problem can be seen as a generalization of the linear assignment problem.